AB-Index: An Efficient Adaptive Index for Branching XML Queries
نویسندگان
چکیده
Query-adaptive XML indexing has been proposed and shown to be an efficient way to accelerate XML query processing, because it dynamically adapts to the workload. However, existing adaptive index lack of support for branching queries, and also with low efficiency for query processing and adaptation operations. In this paper, we propose a new Adaptive index for Branching queries, which is named as AB-Index. It is designed to support XML path queries with branching predicates. Efficient index construction, query processing, and index adaptation algorithms are proposed for AB-Index. In the experiments, the proposed index is demonstrated to outperform the state-of-the-art approach in the area of adaptive index in terms of query and adaptation efficiencies.
منابع مشابه
Practical Indexing XML Document for Twig Query
Answering structural queries of XML with index is an important approach of efficient XML query processing. Among existing structural indexes for XML data, F&B index is the smallest index that can answer all branching queries. However, an F&B index for less regular XML data often contains a large number of index nodes, and hence a large amount of main memory. If the F&B index cannot be accommoda...
متن کاملAn Efficient XML Index Structure with Bottom-Up Query Processing
With the growing importance of XML in data exchange, much research has been done in proving flexible query mechanisms to extract data from structured XML documents. The semi-structured nature of XML data and the requirements on query flexibility pose unique challenges to database indexing methods. Recently, ViST that uses suffix tree and BTree was proposed to reduce the search time of the docum...
متن کاملIndexing Schemes for Efficient Aggregate Computation over Structural Joins
With the increasing popularity of XML as a standard for data representation and exchange, efficient XML query processing has become a necessity. One popular approach encodes the hierarchical structure of XML data through a node numbering scheme, thus reducing typical queries to special forms (structural, path, twig) of containment joins. In this paper we consider how using an index can facilita...
متن کاملWorkload-aware Trie Indexes for XML
Well-designed indexes can dramatically improve query performance. In the context of XML, structural indexes have proven to be particularly effective in supporting efficient XPath queries the core of all XML queries, by capturing the structural correlation between data components in an XML document. The duality of space and performance is an inevitable trade-off at the core of index design. It h...
متن کاملEfficient Processing of XML Path Queries Using the Disk-based F&B Index
With the proliferation of XML data and applications on the Internet, efficient XML query processing techniques are in great demand. Answering queries using XML indexes is a natural approach. A number of XML indexes have been proposed in the literature; among them, F&B Index is one powerful index as it is the smallest index that answers all twig queries. However, an F&B Index suffers from the fo...
متن کامل